منابع مشابه
dynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولInteractive Art Analysis Based on Baudrillard’s Hyper reality Theory, a Case Study of Digital Interactive installation
The contemporary philosopher Jean Baudrillard, one of the postmodernism theorists, considers representation in the contemporary world as a factor in the disappearance of reality. In his view, the main feature of new arts is not the expression of artistic beauty, but communication with the audience and expression of the artist’s ideas. In interactive art, the presence and role of the audience in...
متن کاملInteractive Course Timetabling
Timetabling problems are often solved based upon what is assumed to be complete information about the problem. However, users may later desire modifications to the generated timetable to adapt to changing requirements or increase their personal satisfaction with the solution [1,5,3]. Methods that allow corrections to an existing timetable while leaving most of the solution intact are necessary....
متن کاملSegmentation of Magnetic Resonance Brain Imaging Based on Graph Theory
Introduction: Segmentation of brain images especially from magnetic resonance imaging (MRI) is an essential requirement in medical imaging since the tissues, edges, and boundaries between them are ambiguous and difficult to detect, due to the proximity of the brightness levels of the images. Material and Methods: In this paper, the graph-base...
متن کاملLTCC Course: Graph Theory October 2013 §5 Ramsey Theory and Regularity
Ramsey theory is about results in the following style: no matter how “chaotic” the overall structure is, if we look at the right (usually small) piece of the structure, we will find a pattern. The most standard version of this type of result is the graph Ramsey theorem. Here, the structure we examine is a colouring of the edges of a graph (not necessarily a proper colouring), and the pattern we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Trends in Education
سال: 2017
ISSN: 1805-8949
DOI: 10.5507/tvv.2017.019